Generic Edge Tokens: Representation, Segmentation and Grouping

نویسندگان

  • Xiaofen Zheng
  • Qigang Gao
چکیده

This paper presents a perceptual organization based method for describing, extracting and grouping generic edge features, called Generic Edge Tokens (GET). A GET is a perceptually significant image primitive which represents a class of qualitatively equivalent structure elements. A complete set of GETs includes both linear and non-linear segment classes and junctions of the segments. Edge traces extracted from image are segmented into GETs according to Gestalt Laws of proximity, continuity, and similarity in terms of descriptive image geometry and edge strength. In grouping 2D shapes, an object is described by its made-up GETs and the relations of GETs. The examples of ellipses and parallelograms groupings are provided as an illustration of the method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Maximum Likelihood Framework for Iterative Eigendecomposition

This paper presents an iterative maximum likelihood framework for perceptual grouping. We pose the problem of perceptual grouping as one of pairwise relational clustering. The method is quite generic and can be applied to a number of problems including region segmentation and line-linking. The task is to assign image tokens to clusters in which there is strong relational affinity between token ...

متن کامل

Multiresolution Image Segmentations in Graph Pyramids

”How do we bridge the representational gap between image features and coarse model features?” is the question asked by the authors of [47] when referring to several contemporary research issues. They identify the one-to-one correspondence between salient image features (pixels, edges, corners,...) and salient model features (generalized cylinders, polyhedrons, invariant models,...) as a limitin...

متن کامل

Labeling of curvilinear structure across scales by token grouping

This paper presents an algorithm for labeling curvilinear structure at multiple scales in line drawings and edge images Symbolic CURVE-ELEMENT tokens residing in a spatially-indexed and scale-indexed data structure denote circular arcs fit to image data. Tokens are computed via a small-to-large scale grouping procedure employing a “greedy”, best-first, strategy for choosing the support of new t...

متن کامل

Color based image segmentation as edge preserving filtering and grouping

In this paper we contend that color based image segmentation can be performed in two stages: an edge preserving filtering stage followed by pixel grouping. Furthermore, for the first step, we introduce a framework under which many current filtering approaches (and some novel ones) can be classified. We present experiments where a new method, called Color Mean Shift, outperforms all the other me...

متن کامل

Segmentation via Graph-Spectral Methods and Riemannian Geometry

In this paper, we describe the use of graph-spectral techniques and their relationship to Riemannian geometry for the purposes of segmentation and grouping. We pose the problem of segmenting a set of tokens as that of partitioning the set of nodes in a graph whose edge weights are given by the geodesic distances between points in a manifold. To do this, we commence by explaining the relationshi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003